Informatics Publishing Limited

A. Prakash ¹, C. Chandrasekar ²

Affiliations
1 Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu, IN
2 Department of Computer Science, Periyar University, Salem, Tamil Nadu, IN

Abstract

The credit card payment system is a widespread usable system which provides the easiest way of payment to the customers, but some of them misuse another individual's credit card for personal reasons. So, in order to provide credit card fraud detection, Multiple Semi-Hidden Markov Model is suggested to gather multiple observations and the detection phase is executed. It is significant to compute the good model parameters because it impacts the detection performance in the Multiple Semi-Hidden Markov Model. So, in this manuscript an innovative technique is introduced which is called Optimized Multiple Semi-Hidden Markov Model (OMSHMM) which is used for optimizing the model parameters. The Multiple Semi-Hidden Markov Model is used for detecting fraudulent users and for optimizing training values Cuckoo Search algorithm is proposed. The main intent of this research is automating the use of Multiple Semi-Hidden Markov Model, by liberating customers from the necessity of statistical knowledge. The number of states and also its model parameters are decided by the Cuckoo Search algorithm. An experimental result shows that when compared to the existing research there is high accuracy in the proposed research.

Keywords

Credit Card Fraud Detection, Cuckoo Search Optimization, Multiple Semi-Hidden Markov Model.

Full Text

   

R. Harini ¹, C. Chandrasekar ²

Affiliations
1 Sengunthar Arts and Science College, Namakkal, IN
2 Department of Computer Science, Periyar University, Salem

Abstract

Objective: Medical Image Processing needs to have images to be processed in a more meaningful way for the diagnostic purposes. In the MRI diagnosis, the exact status of Brain tumor is not obtained. The objective of this research work is to find an MRI scanned image of brain is cancerous or not, because the benign stage is not visible so easily. Methods: In the research work, a novel approach is applied using Nearest Neighbour classification with Fuzzy Logic, directly accessing on the intensity of the pixels without omitting any region of the image. The Bayesian Classifier is further applied to classify the segmented regions such as normal and abnormal. The sequential matching is performed with every region using its feature space. It is also novel because it's using similarity measures of the trained set images and not on the geometric shape modeling. Findings: The MRI scanned image is applied with NN classifier using along with Fuzzy logic gives 12% to 18% is better than Multi region Graph cut. Contrast to existing NN classifier, the execution time in BCEV (Bayesian Classifier using Eigen Vector) is low and the variance is 10-20% low in the proposed BCEV. Compared with an existing and other works, the proposed efficient sequential pattern matching algorithm for classified brain image system provides an efficient estimation and the variance is 5-10% high in the proposed ESPM than when compared to BCEV, 8-10% higher than NN classifier and fuzzy logic method and 10-15% higher than existing graph cut method. Application/Improvement: The results show that our proposed approach gives high level of accuracy, execution faster and higher flexibility in segmentation, classification and in matching.

Keywords

Classification, Image Segmentation, Pattern Matching, Similarity Measure.

Full Text

   

K. Jayasudha ¹, C. Chandrasekar ²

Affiliations
1 Department of Computer Application,K. S. Rangasamy College of Technology, Tamilnadu,, IN
2 Periyar University, Salem, Tamilnadu, IN

Abstract

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. In VANET, the possible occurrence of link breakage event is unknown and unpredictable. In a packet forwarding event, one node could select a next forwarder from its neighbors. The neighbor node that was in the transmission range at the moment, but at the edge, could already have left this range and, choosing this neighbor as next forwarder will lead to low packet delivery, increased packet delay, and increased routing overhead. In this paper, we propose HCBGR (Hierarchical Clustering Based Greedy Routing), a greedy position based routing approach which uses weighted score based strategy for reliable and efficient packet forwarding. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. The simulation results using ns 2.33 show that routing overhead is reduced considerably compared to Greedy Perimeter Stateless Routing Protocol (GPSRP) and Predictive Directional Greedy Routing Protocol (PDGRP) of VANET. The simulation results show that HCBGR had overcome the limitations of PDGRP and GPSRP in VANET environment.

Keywords

Vehicular Ad Hoc Networks, Greedy Position Based Routing, Clustering, HCBGR.

Full Text

     

S. Mohanapriya ¹, C. Chandrasekar ²

Affiliations
1 Department of MCA in K.S.R.College of Engineering, Tiruchengode, IN
2 Department of Computer Science in Periyar University, Salem, IN

Abstract

With the emergence of many group-oriented distributed applications such as tele / video-conferencing and multiplayer games, there is a need for providing group-oriented communication privacy and data integrity. For this members of the group can establish a common secret key for encrypting group communication data. Traditional secure group communication problems differ from the distributed group key agreement on the characteristics such as distributed, collaborative and dynamic nature. Instead of performing individual rekeying operations, an interval-based approach of rekeying is adopted i.e., Rebuild algorithm, Batch algorithm and the Queue-batch algorithm. The interval-based approach provides rekeying efficiency for dynamic peer groups while preserving both distributed and contributory properties.

The work presented in this paper, concentrated on authenticated group key agreement protocol incorporated into the interval-based algorithms and evaluate the performance to prove its security properties. The Secure Communication Library implemented realizes the interval-based algorithms with a programming interface for the development of secure group-based applications. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. The simulation conducted on NS-2 show that the interval-based algorithms significantly outperform the individual rekeying approach. The Queue-batch algorithm performs the best among the three interval-based algorithms. The Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment.

Keywords

Diffie–Hellman protocol,NS-2.

Full Text

     

C. Chandrasekar ¹, P. T. Arshad ²

Affiliations
1 Department of Computer Science, Sree Narayana Guru College, K. G. Chavadi, Coimbatore, IN
2 Sree Narayana Guru College, K. G. Chavadi, Coimbatore, IN

Abstract

There is a several types of sleep wake scheduling protocols have been suggested in the research survey. One of the sleep wakes scheduling protocol have been proposed as Synchronized sleep wake scheduling. The sensor nodes are periodically or a periodically exchange the synchronization information with neighbor nodes using these protocols. Though, additional communication overhead and a considerable amount of energy are consumed using such synchronization procedures. On-demand sleep, wake scheduling protocols has been projected, where nodes turn off most of their circuitry and always work on a secondary low-powered receiver to listen to “wake-up” calls from neighboring nodes when there is a need for relaying packets. The costs of sensor motes are increase significantly using on-demand sleep wake due to the additional receiver. In this paper, the proposals of sleep wake scheduling protocols are interested to use the asynchronous techniques such as those proposed. In these protocols, each node wakes up independently of neighboring nodes in order to save energy. An additional delay are included due to the independence of the wake-up processes at each node along the path to sink for the reason that each node needs to wait for its next-hop node to wake up before it can transmit the packet. This delay could be unacceptable for delay-sensitive applications like fire detection or a tsunami alarm and which requires the event reporting delay to be small.

Keywords

Sleep-Wake, Sensor Node, Wireless Networks, Energy.

Full Text

     

K. M. Naseera ¹, C. Chandrasekar ²

Affiliations
1 Department of Computer Science at Sree Narayana Guru College, K.G.Chavadi, Coimbatore, Tamilnadu, IN
2 Computer Science from the Bharathiar University, Coimbatore, Tamilnadu, IN

Abstract

A Mobile Ad-hoc Network (MANET) is a dynamic wireless network that can be formulated without the need for any pre-existing infrastructure in which each node can act as a router. One of the main challenges of MANET is the design of robust routing protocol that adapt to the frequent and randomly changing network topology. A variety of routing protocols have been proposed and most of them have been extensively simulated or implemented as well. Several attacks are possible in the available routing protocols such as Wormhole attack, black hole attack, byzantine attack, etc. Among these attacks black hole attack is of major concern in AODV, is one of the popular routing protocols for MANET. Due to security vulnerabilities of the AODV routing protocol, wireless ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack. In this study, analyzed the use of AOMDV (Ad-hoc On-demand Multipath Distance Vector) and improved the security of MANET against the black hole attack. The main objective is to provide security against the Black hole attack.

Keywords

MANET, Black Hole Attack, AODV, AOMDV.

Full Text

     

C. Chandrasekar ¹, S. Padmavathy ²

Affiliations
1 Manonmaniam Sundaranar University, Tirunelveli, IN
2 Sree Narayana Guru College, Coimbatore-641105, IN

Abstract

Voice over IP is the process of transmission of voice over packet-switched IP networks is one of the most important emerging trends in telecommunications. The VOIP introduces both security risks and opportunities. VOIP has a very different architecture than traditional circuit-based telephony, and these differences result in significant security issues. Lower cost and greater flexibility are among the promises of VOIP for the enterprise, but VOIP should not be installed without careful consideration of the security problems introduced. VOIP systems take a wide variety of forms, including traditional telephone handsets, conferencing units, and mobile units. In addition to end-user equipment, VOIP systems include a variety of other components, including call processors/call managers, gateways, routers, firewalls, and protocols. Most of these components have counterparts used in data networks, but the performance demands of VOIP mean that ordinary network software and hardware must be supplemented with special VOIP components. Quality of Service (QoS) is fundamental to the operation of a VOIP network that meets users’ quality expectations. However, the implementation of various security measures can cause a marked deterioration in QoS. These complications range from firewalls delaying or blocking call setups to encryption-produced latency and delay variation (jitter). Because of the time-critical nature of VOIP, and its low tolerance for disruption and packet loss, many security measures implemented in traditional data networks are simply not applicable to VOIP in their current form; firewalls, intrusion detection systems, and other components must be specialized for VOIP. Thus an anonymous multipath routing protocol that is a secured protocol called AOMDV, based on secret sharing is proposed. The protocol provides identity anonymity, location anonymity, data and traffic anonymity by employing cryptograph technology and secret sharing in VOIP communication process. Simulation results show that the proposed scheme provides a reasonably good level of network security.

Keywords

Voice Over IP, AOMDV, Quality of Service, Multipath Routing, Secret Sharing, Anonymity.

Full Text

     

C. Chandrasekar ¹, S. Padmavathy ²

Affiliations
1 Manonmaniam Sundaranar University, Tirunelveli, IN
2 Sree Narayana Guru College, Coimbatore – 641 105, IN

Abstract

Mobile Ad Hoc Network (MANET) is a group of mobile nodes which communicates with each other without any of the supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Because the intrinsic characteristics of mobile ad hoc networks (MANETs) cause several vulnerabilities, anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns. Most of them are single path or use one path at a time, and the multipath schemes cannot thwart both the passive attacks and active attacks simultaneously. Thus an anonymous multipath routing protocol that is a secured protocol called AOMDV, based on secret sharing is proposed. The protocol provides identity anonymity, location anonymity, data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process. Meanwhile, a hash function is introduced to detect active attacks in the data transmission process. The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks (such as interception and physical destroy attacks). Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

Keywords

Multipath Routing, Secret Sharing, Anonymity, AOMDV, Mobile Ad Hoc Network (MANET).

Full Text

     

L. Sankari ¹, C. Chandrasekar ²

Affiliations
1 Department of comp.Science, Sri Ramakrishna College of Arts and Science for women, Coimbatore, IN
2 Dept of Computer Science, Periyar University, Salem, IN

Abstract

In image processing, segmentation means dividing the image into homogeneous regions. The task of recognizing the patterns is a crucial task. Since the result is based on which image segmentation algorithm the application is using. A number of image segmentation algorithms are available using data mining techniques like clustering based algorithms, classification based algorithms and semi supervised based algorithms. This paper discusses about two semi supervised image segmentation ideas with one standard model based algorithm (EM Cluster Algorithm). In semi supervised method both labeled and unlabeled data are used to improve the performance of segmentation. The first paper discuss about standard EM algorithms The second paper discuss about semi supervised image segmentation using mouse clicks as prior information and the third paper discuss about optimal seed selection with semi supervised segmentation. The result of analysis shows that the optimal seed selection (method III) gives better results and then clustering gives more accurate results. The Image attributes are intensity and color.

Keywords

Semi Supervised Clustering, Image Segmentation, Em Clustering, Model Based Clustering.

Full Text

     

G. A. Preethi ¹, C. Chandrasekar ¹

Affiliations
1 Department of Computer science, Periyar University, Salem, Tamil Nadu, IN

Abstract

One of the major issues in next generation heterogeneous networks is the issue of vertical handoff for providing seamless integration and Quality of Service. Even though several approaches have been proposed to solve the handoff problem, we have proposed an enhanced method. The main objective is to provide a diverse range of high data transfer services across different wireless networks. In this paper we propose a Multiple Attribute Decision making method for providing the handoff decision. Our main goal is to provide easy and indisputable handoff decision methods suitable for heterogeneous networks. Vertical Handoff occurs when an active communication session is transferred between different heterogeneous radio access technologies. We are going to propose Simple Additive Weighting (SAW) method and compare with Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Analytical Hierarchy Process(AHP). Results show good performance of our proposed scheme over other two MADM Processes.

Keywords

AHP, Handoff Decision, Mobile Terminal, Mobile Wireless Networks, Service Continuity, SAW, TOPSIS, Vertical Handoff.

Full Text

     

C. Chandrasekar ¹, P. S. Meena ¹

Affiliations
1 Sree Narayana Guru College, Coimbatore-641105, IN

Abstract

This Biological studies progress through the expansion of the expertise technologies. DNA microarrays turn out to be an effective tool utilized in molecular biology and in medicine. DNA micro arrays can be utilized to determining the alterations in expression levels or to identify single nucleotide polymorphisms. One can examine the expression of various genes in a single reaction in fast and effective manner. Microarrays can be utilized to determine the comparative amount of particular mRNAs in two or more tissue samples for thousands of genes concurrently. As the supremacy of this technique has been identified, various open queries arise about suitable examination of microarray data. For the above impenetrability and to obtain better consequences of the system with accuracy a new learning algorithm called Extreme Learning Machine (ELM) is used. ELM overcomes difficulties such as local minima, inappropriate learning rate and overfitting usually occurred by iterative learning techniques and performs the training rapidly. ELM utilizes the error free ANOVA techniques in the preprocessing stage. This paper represents that ANOVA technique can be utilized to normalize microarray data and afford determination of alterations in gene expression that are corrected for potential perplexing effects. The proposed technique is evaluated with the help of Lymphoma data set. The experimental result represents that proposed technique results in better classification accuracies with lesser training time and implementation complexity compared to conventional techniques.

Keywords

ELM, ANOVA, Cancer Classification and Gene Expression, Fast ELM.

Full Text

     

A. P. Shanmugasundaram ¹, C. Chandrasekar ²

Affiliations
1 Department of Computer Science, Karpagam University, Coimbatore-21, IN
2 Department of Computer Science, Periyar University, Salem-11, IN

Abstract

Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of packet delivery over multi-hopbut failed provide higher throughputon the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses the Average Time Standard (ATS) to guarantee the required packet allocationwith higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network.MMTDD mechanism makes use of time scheduling schemestodiscover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such as time consumption, data delivery rate,average delivery delay and throughput level.

Keywords

Median Multicast Reliable Data Delivery, Ad-Hoc Network, Delivery Ratio, Average Time Standard, Time Scheduling, Throughput Level.

Full Text

   

S. Sivakumar ¹, C. Chandrasekar ¹

Affiliations
1 Department of Computer Science, Periyar University, Salem-11, Tamilnadu, IN

Abstract

Feature Selection is an important preprocessing step for most machine learning algorithms especially pattern classification. Feature Selection aims in determining the most relevant and useful subset of features from the dataset representing any application domain, without compromising the predictive accuracy represented by the actual set of features. There are many meta-heuristic search algorithms are used to solving combinatorial optimization problems. This paper aims at investigating, implementing, and analyzing a feature selection method using the Artificial Bee Colony approach to classification of lung cancer image database.

Keywords

Feature Selection, ABC, k-NN, SVM, Classification Accuracy.

Full Text

   

K. Prasanth ¹, K. Duraiswamy ², K. Jayasudha ³, C. Chandrasekar ⁴

Affiliations
1 Dept of IT, K.S.Rangasamy College of Technology, Tiruchengode (T.N), IN
2 Dept of CSE, K.S.Rangasamy College of Technology, Tiruchengode (T.N), IN
3 Dept of Computer Applications, K.S.R College of Engineering, Tiruchengode (T.N), IN
4 Periyar University, Salem (T.N), IN

Abstract

Vehicular Ad-hoc Networks (VANETs) have been recently attracting an increasing attention from both research and industry communities. VANETs are currently deployed on a large scale, research in this area is mostly simulation based. Mobility models or the movement patterns of nodes communicating wirelessly, play a vital role in determining the protocol performance in VANET. We still have a limited understanding of the required level of mobility details for modeling and simulating VANETs. Thus, it is essential to study and analyze various mobility models and their effect on VANET protocols. In this paper, we examine d different mobility models proposed in the recent research literature. We proposed Revival Mobility Model (RMM) and evaluate its effect on packet delivery in VANETs by ns-2 simulations.

Keywords

Vehicular Ad Hoc Networks, Mobility Modeling, Revival Mobility Model, Packet Delivery Ratio.

Full Text